Dynamic Vehicle Routing Problem for Medical Emergency Management
نویسندگان
چکیده
Nowadays telemedicine applications are more and more present in the state-of-the-art medicine. Telemedicine is a good way to improve access to healthcare, quality of care, reduce isolation and also costs. In that way we can now safely perform surgery between two places separated by several thousand km, navigate in 3D models of blood vessels or generate 3D models from Nuclear-Magnetic Resonance Imaging (MRI). But there is currently a lack of tools for all day medical acts which could improve medical system efficiency especially for medical emergency services. In order to help medical emergency services, the project MERCURE (Mobile and Network for the Private clinic, the Urgency or the External Residence) has been launched in order to create tools that optimize, follow and manage emergency interventions. The current problem is that the choice of the doctor for a patient is done by hand.The call center is neither aware of the exact location nor the current state of the doctors. Thus it is rarely the best located doctor who is chosen and moreover he may not have correct equipments to heal the patient. To optimize that aspect, we have developed software allowing the optimized management of human and material medical resources. This problem, conventionally called vehicle routing problem (VRP), is one of the most widely studied problems in combinatorial optimization. In the standard VRP, a fleet of vehicles must be routed to visit a set of customers at minimum cost, subject to vehicle capacity constraint and route duration constraint. In the static version of the problem, it is assumed that all customers are known in advance to the planning process. In the case of medical emergency management, it includes some dynamic elements. The information data often tends to be uncertain or even unknown at the time of the planning. It may be the case that patients, driving times or service times, are unknown before the day of operation has begun, but become available in real-time. Due to the recent advances in information and communication technologies, such as geographic information systems (GIS), global positioning systems (GPS) and mobile phones, companies are now able to manage vehicle routes in real-time. Hence, with the increased access to these services, the need for robust real-time optimization procedures will be of critical importance, for small to big distribution companies, whose logistics are based on a high reactivity to the customer demand.
منابع مشابه
A time-dependent vehicle routing problem for disaster response phase in multi-graph-based network
Logistics planning in disaster response phase involves dispatching commodities such as medical materials, personnel, food, etc. to affected areas as soon as possible to accelerate the relief operations. Since transportation vehicles in disaster situations can be considered as scarce resources, thus, the efficient usage of them is substantially important. In this study, we provide a dynamic vehi...
متن کاملA GIS-based Dynamic Shortest Path Determination in Emergency Vehicles
Accomplishing an effective routing of emergency vehicle will minimize its response time and will thus improve the response performance. Traffic congestion is a critical problem in urban area that influences the travel time of vehicles. The aim of this study is developing a spatial decision support system (SDSS) for emergency vehicle routing. The proposed system is based on integration of geospa...
متن کاملA green vehicle routing problem with customer satisfaction criteria
This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملFuzzy Vehicle Routing Problem with Split Delivery: Trade-off between Air Pollution and Customer Satisfaction
In large-scale emergency, the vehicle routing problem focuses on finding the best routes for vehicles. The equitable distribution has a vital role in this problem to decrease the number of death and save people's lives. In addition to this, air pollution is a threat to people’s life and it can be considered to omit other kinds of disasters happens because of it. So, a new MINLP model presented ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012